منابع مشابه
A Novel Power-Efficient Broadcast Routing Algorithm Exploiting Broadcast Efficiency
It has been shown that the problem of finding a broadcast routing tree with minimum total transmit power is NPhard. Hence, developing a heuristic power-efficient algorithm is crucial. The seminal work in this area is the well-known Broadcast Incremental Power (BIP) algorithm with a recent addition called Embedded Wireless Multicast Advantage (EWMA) algorithm. In this paper, we present yet anoth...
متن کاملThe Cost of Global Broadcast Using Abstract MAC Layers
We analyze greedy algorithms for broadcasting messages throughout a multi-hop wireless network, using a slot-based model that includes message collisions without collision detection. Our algorithms are split formally into two pieces: a high-level piece for broadcast and a low-level piece for contention management. We accomplish the split using abstract versions of the MAC layer to encapsulate t...
متن کاملA Simple Convex Layers Algorithm
Given a set of n points P in the plane, the first layer L1 of P is formed by the points that appear on P ’s convex hull. In general, a point belongs to layer Li, if it lies on the convex hull of the set P \ ⋃ j<i{Lj}. The convex layers problem is to compute the convex layers Li. Existing algorithms for this problem either do not achieve the optimal O (n log n) runtime and linear space, or are o...
متن کاملUsing Broadcast Primitives in Replicated Databases y I. Stanoi
We explore the use of di erent variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a twophase commitment protocol for ensurin...
متن کاملEvaluation of a Broadcast Scheduling Algorithm
One of the two main approaches of data broadcasting is pullbased data delivery. In this paper, we focus on the problem of scheduling data items to broadcast in such a pull-based environment. Previous work has shown that the Longest Wait First heuristic has the best performance results compared to all other broadcast scheduling algorithms, however the decision overhead avoids its practical imple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Network Security & Its Applications
سال: 2016
ISSN: 0975-2307,0974-9330
DOI: 10.5121/ijnsa.2016.8303